Directed animals, forests and permutations
نویسندگان
چکیده
In this paper, we illustrate a method to enumerate two-dimensional directed animals, with compact sources, on both the square and the triangular lattice. We give a recursive description of these structures from which we deduce their generating function, according to various parameters: the area, the right half-width and the number of compact sources. We determine the average number of compact sources in both lattices. Referring to single-source animals on the square lattice, we show the bijections connecting them to the forests of 1–2 trees and to permutations with the forbidden subsequences: 321; 4 1523. In a similar way we describe the bijections between single-source animals on the triangular lattice and forests of binary trees. Each of these two objects presents a bijection with two permutations with the forbidden subsequences: 4132, 4231, 4312, 4321. c © 1999 Elsevier Science B.V. All rights reserved
منابع مشابه
Modelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملGeneralized Stirling Permutations and Forests: Higher-Order Eulerian and Ward Numbers
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural three-parameter generalization of the well-known Eulerian numbers. We give the generating function for this new class of numbers and, in the simplest cases, we...
متن کامل2 2 Fe b 20 05 COMMUTATIVE HOPF ALGEBRAS OF PERMUTATIONS AND TREES
We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general construction based on graphs, and its non-commutative dual is realized in three different ways, in particular as the Grossman-Larson algebra of heap ordered trees....
متن کاملEnumeration of snakes and cycle-alternating permutations
Springer numbers are analogs of Euler numbers for the group of signed permutations. Arnol’d showed that they count some objects called snakes, which generalize alternating permutations. Hoffman established a link between Springer numbers, snakes, and some polynomials related with the successive derivatives of trigonometric functions. The goal of this article is to give further combinatorial pro...
متن کاملGenerating Permutations and Combinations
We consider permutations of {1, 2, . . . , n} in which each integer is given a direction; such permutations are called directed permutations. An integer k in a directed permutation is called mobile of its arrow points to a smaller integer adjacent to it. For example, for → 3 → 2 ← 5 → 4 → 6 → 1 , the integers 3, 5, and 6 are mobile. It follows that 1 can never be mobile since there is no intege...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 204 شماره
صفحات -
تاریخ انتشار 1999